Local algorithms for hierarchical dense subgraph discovery
نویسندگان
چکیده
منابع مشابه
A Survey of Algorithms for Dense Subgraph Discovery
In this chapter, we present a survey of algorithms for dense subgraph discovery. The problem of dense subgraph discovery is closely related to clustering though the two problems also have a number of differences. For example, the problem of clustering is largely concerned with that of finding a fixed partition in the data, whereas the problem of dense subgraph discovery defines these dense comp...
متن کاملK-Clique-Graphs for Dense Subgraph Discovery
Finding dense subgraphs in a graph is a fundamental graph mining task, with applications in several fields. Algorithms for identifying dense subgraphs are used in biology, in finance, in spam detection, etc. Standard formulations of this problem such as the problem of finding the maximum clique of a graph are hard to solve. However, some tractable formulations of the problem have also been prop...
متن کاملDense subgraph problem revisited
We note the condition 0 ≤ w(e) ≤ 1 is given since it is convenient for presenting our theoretical results, although we can define each problem without this condition. We say unweighted dense subgraph problem if w(e) = 1 for each edge. We define the density ∆ of the output subgraph H to be ∆ = 2w(F ) k(k−1) for the non-bipartite case and ∆ = w(F ) m′n′ for the bipartite case. In other words, den...
متن کاملHierarchical Performance Modeling for Ranking Dense Linear Algebra Algorithms
I hereby declare that this thesis is entirely the result of my own work except where otherwise indicated. I have only used the resources given in the list of references.
متن کاملThe Dense k Subgraph problem
Given a graph G = (V, E) and a parameter k, we consider the problem of finding a subset U ⊆ V of size k that maximizes the number of induced edges (DkS). We improve upon the previously best known approximation ratio for DkS, a ratio that has not seen any progress during the last decade. Specifically, we improve the approximation ratio from n 0.32258 to n 0.3159. The improved ratio is obtained b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2018
ISSN: 2150-8097
DOI: 10.14778/3275536.3275540